Varieties of misrepresentation and homomorphism
نویسندگان
چکیده
منابع مشابه
Reliable Misrepresentation and Teleosemantics
Mendelovici (forthcoming) has recently argued that (1) tracking theories of mental representation (including teleosemantics) are incompatible with the possibility of reliable misrepresentation and that (2) this is an important difficulty for them. Furthermore, she argues that this problem commits teleosemantics to an unjustified a priori rejection of color eliminativism. In this paper I argue t...
متن کاملMisrepresentation in District Voting
Voting systems in which voters are partitioned to districts encourage accountability by providing voters an easily identifiable district representative, but can result in a selection of representatives not representative of the electorate’s preferences. In some cases, a party may have a majority of the popular vote, but lose the elections due to districting effects. We define the Misrepresentat...
متن کاملMedicine and the media--misrepresentation of interview.
Sir, In your new feature 'Medicine and the Media' (8th July, p. 121) you mention my contribution to what you considered a muddled feature on the hazards of jogging in Tonight (BBC 1, 28 June). Perhaps the inside story may be of help to some of your readers as an example of what happens to the naive clinician when faced with the media. I am tending now very strongly to the view that the producer...
متن کاملTyler Perry and The Weight of Misrepresentation
Criticism of black film production often includes discussions of narrow typecasting and stereotypical role portrayal. Previous research shows that consumers of black films attest that such films are an accurate depiction of black culture. However, consequences of negative stereotypes presented in mainstream media are rarely discussed. The purpose of this study is to define and examine the stere...
متن کاملExact Algorithm for Graph Homomorphism and Locally Injective Graph Homomorphism
For graphs G and H , a homomorphism from G to H is a function φ : V (G) → V (H), which maps vertices adjacent in G to adjacent vertices of H . A homomorphism is locally injective if no two vertices with a common neighbor are mapped to a single vertex in H . Many cases of graph homomorphism and locally injective graph homomorphism are NPcomplete, so there is little hope to design polynomial-time...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal for Philosophy of Science
سال: 2015
ISSN: 1879-4912,1879-4920
DOI: 10.1007/s13194-015-0125-x